Reflection principles and provability algebras in formal arithmetic

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reflection principles and provability algebras in formal arithmetic

We study reflection principles in fragments of Peano arithmetic and their applications to the questions of comparison and classification of arithmetical theories. Bibliography: 95 items.

متن کامل

Principles of Constructive Provability Logic

We present a novel formulation of the modal logic CPL, a constructive logic of provability that is closely connected to the Gödel-Löb logic of provability. Our logical formulation allows modal operators to talk about both provability and non-provability of propositions at reachable worlds. We are interested in the applications of CPL to logic programming; however, this report focuses on the pre...

متن کامل

Explicit Proofs in Formal Provability Logic

In this paper we answer the question what implicit proof assertions in the provability logic GL can be realized by explicit proof terms. In particular we show that the fragment of GL which can be realized by generalized proof terms of GLA is exactly S4∩GL and equals the fragment that can be realized by proof-terms of LP. Additionally we show that the problem of determining which implicit provab...

متن کامل

Multifunction algebras and the provability of PH

We introduce multifunction algebras Bτ i where τ is a set of 0 or 1-ary terms used to bound recursion lengths. We show that if for all ` ∈ τ we have ` ∈ O(|x|) then Bτ i = FP p i−1(wit, τ̇), those multifunctions computable in polynomial time with at most O(p(`(x))) queries to a Σpi−1 witness oracle for ` ∈ τ and p a polynomial. We use our algebras to obtain independence results in bounded arithm...

متن کامل

Authenticity and Provability - A Formal Framework

Authentication and non-repudiation are essential security requirements for electronic commerce applications and other types of binding telecooperation. Symmetric and asymmetric encryption techniques and different types of digital signatures can be used to provide these security services. However, cryptographic algorithms can only provide isolated functionality that has to be integrated into mor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Russian Mathematical Surveys

سال: 2005

ISSN: 0036-0279,1468-4829

DOI: 10.1070/rm2005v060n02abeh000823